A general Sequential Time-Space Tradeoff for Finding Unique Elements
نویسندگان
چکیده
منابع مشابه
A Time-Space Tradeoff for Element Distinctness
In a time-space tradeoff for sorting on non-oblivious machines, Borodin et. Al. [J. Comput. System Sci., 22(1981), pp. 351-364] proved that to sort $n$ elements requires $TS=\Omega(n^2)$ where $T=time$ and $S=space$ on a comparison based branching program. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately fol...
متن کاملTopological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure the user can select from a spectrum of algorithms, the one that best meets a given time-space specification. T...
متن کاملA Note on Bennett's Time-Space Tradeoff for Reversible Computation
Given any irreversible program with running time T and space complexity S, and given any e > 0, Bennett shows how to construct an equivalent reversible program with running time O(T1+) and space complexity O(S In T). Although these loose upper bounds are formally correct, they are misleading due to a hidden constant factor in the space bound. It is shown that this constant factor is approximate...
متن کاملA Greedy Algorithm for Time–Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any–space algorithm for exact inference in Bayesian networks, which can trade space for time by varying its cache size. When RC is run with a constrained cache size, an important problem arises: Which specific results should be cached in order to minimize the running time of the algorithm? Prior work has focused on finding the optimal cache allocation using bra...
متن کاملA nondeterministic space-time tradeoff for linear codes
We consider nondeterministic D-way branching programs computing functions f : D → {0, 1} in time at most kn. In the boolean case, where D = {0, 1}, no exponential lower bounds are known even for k = 2. Ajtai has proved such lower bounds for explicit functions over domains D of size at least n, and Beame, Saks and Thathachar for explicit functions over domains of size at least 2 k . In this note...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1991
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0220017